Metaheuristics in large-scale global continues optimization: A survey

نویسندگان

  • Sedigheh Mahdavi
  • Mohammad Ebrahim Shiri
  • Shahryar Rahnamayan
چکیده

Metaheuristic algorithms are extensively recognized as effective approaches for solving high-dimensional optimization problems. These algorithms provide effective tools with important applications in business, engineering, economics, and science. This paper surveys state-of-the-art metaheuristic algorithms and their current applications in the field of large-scale global optimization. The paper mainly covers the fundamental algorithmic frameworks such as decomposition and non-decomposition methods. More than 200 papers are carefully reviewed to prepare the current comprehensive survey. 2014 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CACO : Competitive Ant Colony Optimization, A Nature-Inspired Metaheuristic For Large-Scale Global Optimization

Large-scale problems are nonlinear problems that need metaheuristics, or global optimization algorithms. This paper reviews nature-inspired metaheuristics, then it introduces a framework named Competitive Ant Colony Optimization inspired by the chemical communications among insects. Then a case study is presented to investigate the proposed framework for large-scale global optimization.

متن کامل

A Survey on Metaheuristics for Solving Large Scale Optimization Problems

In recent years, there has been a remarkable improvement in the computing power of computers. As a result, numerous realworld optimization problems in science and engineering, possessing very high dimensions, have appeared. In the research community, they are generally labeled as Large Scale Global Optimization (LSGO) problems. Several Metaheuristics has been proposed to tackle these problems. ...

متن کامل

DISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM

Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...

متن کامل

A HYBRID MODIFIED GENETIC-NELDER MEAD SIMPLEX ALGORITHM FOR LARGE-SCALE TRUSS OPTIMIZATION

In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...

متن کامل

Training MLP Network Using Scatter Search as a Global Optimizer

Many real life optimization problems are nonconvex and may have several local minima within their feasible region. Therefore, global search methods are needed. Metaheuristics are efficient global optimizers including a metastrategy that guides a heuristic search. Genetic algorithms, simulated annealing, tabu search and scatter search are the most well-know metaheuristics. In general, they do no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 295  شماره 

صفحات  -

تاریخ انتشار 2015